翻訳と辞書 |
Incidence (graph) : ウィキペディア英語版 | Incidence (graph) In graph theory, an incidence is a pair where is a vertex and is an edge incident to . Two distinct incidences and are adjacent if and only if , or or . An incidence coloring of a graph is an assignment of a color to each incidence of G in such a way that adjacent incidences get distinct colors. It is equivalent to a strong edge coloring of the graph obtained by subdivising once each edge of . == References ==
(|The Incidence Coloring Page ), by Éric Sopena.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Incidence (graph)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|